Proving Resource Consumption of Low-level Programs Using Automated Theorem Provers

Towards Modularly Comparing Programs Using Automated Theorem Provers

In this paper, we present a general framework for modularly comparing two (imperative) programs that can leverage single-program verifiers based on automated theorem provers. We formalize (i) mutual summaries for comparing the summaries of two programs, and (ii) relative termination to describe conditions under which two programs relatively terminate. The two rules together allow for checking c...

Using Automated Theorem Provers in Nonassociative Algebra

We present a case study on how mathematicians use automated theorem provers to solve open problems in (non-associative) algebra.

Higher-Order Automated Theorem Provers

Automated Theorem Proving

Material for the course Automated Theorem Proving at Carnegie Mellon University, Fall 1999. This includes revised versions from the course notes on Linear Logic (Spring 1998) and Computation and Deduction (Spring 1997). Material for this course is available at http://www.cs.cmu.edu/~fp/courses/atp/. Please send comments to [email protected] This material is in rough draft form and is likely to cont...

Using Automated Theorem Provers to Certify Auto-generated Aerospace Software

We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligations which are then processed by an automated first-order theorem prover (ATP). For full automation, however, the obligations must be aggressively preprocessed and simplified. We describe the unique requirements this pla...